A Reversion of the Chernoff Bound
نویسنده
چکیده
This paper describes the construction of a lower bound for the tails of general random variables, using solely knowledge of their moment generating function. The tilting procedure used allows for the construction of lower bounds that are tighter and more broadly applicable than existing tail approximations.
منابع مشابه
A Comprehensive Performance Analysis of Direct Detection Receivers inWDMASystems
In this work the performance of a wavelength division multiple access (WDMA) system with direct detection receiver is investigated. For this purpose, the probability of error in a WDMA network with OOK modulation considering crosstalk, ISI, photo detector noise and thermal noise is calculated and the effect of each on system performance is investigated. The system performance in presence of PIN...
متن کامل3 Chernoff Bound
Before we venture into Chernoff bound, let us recall Chebyshev's inequality which gives a simple bound on the probability that a random variable deviates from its expected value by a certain amount.
متن کاملTwo Refinements of the Chernoff Bound for the Sum of Nonidentical Bernoulli Random Variables
We give two refinements to the Chernoff bound for the sum of nonidentical Bernoulli random variables with parameters pi, where 0 < pi < 1 and i = 1, ..., n. Traditionally, the Chernoff bound is a function of the arithmetic mean of the pi’s, n−1 ∑n i=1 pi. The refined bounds contain the term n−1 ∑n i=1 p 2 i , and hence, are able to capture the variations of pi’s.
متن کاملAn algorithmic proof of the Chernoff-Hoeffding bound
We provide a simple algorithmic argument to “explain” the concentration of measure phenomenon observed in the sum of independent random variables. Roughly speaking, we observe that without concentration of measure it would be possible to predict the outcome of a coin toss with probability greater than 1/2. We use this idea to derive an alternative proof of a Chernoff-Hoeffding bound for large d...
متن کاملChernoff Bounds, and Some Applications
Preliminaries Before we venture into Chernoff bound, let us recall two simple bounds on the probability that a random variable deviates from the mean by a certain amount: Markov's inequality and Chebyshev's inequality. Markov's inequality only applies to non-negative random variables and gives us a bound depending on the expectation of the random variable.
متن کامل